Optimal random search for a single hidden target

Optimal random search for a single hidden target.

A single target is hidden at a location chosen from a predetermined probability distribution. Then, a searcher must find a second probability distribution from which random search points are sampled such that the target is found in the minimum number of trials. Here it will be shown that if the searcher must get very close to the target to find it, then the best search distribution is proportio...

Optimal Batch Production for a Single Machine System with Accumulated Defectives and Random Rate of Rework

In this paper we consider an imperfect production system which produces good and defective items and assume that defective items can be reworked. Due to the nature of rework process we do not restrict the rework rate to be equal to normal production rate or constant and assume that it is a random variable with an arbitrary distribution function. We also assume as it is true in most real world s...

Optimal Whereabouts Search for a Moving Target

PSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION

Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...

OPTIMAL DESIGN OF DIAGRID MODULES BY PSEUDO RANDOM DIRECTIONAL SEARCH

The present work reveals a problem formulation to minimize material consumption and improve efficiency of diagrids to resist equivalent wind loading. The integrated formulation includes not only sizing of structural members but also variation in geometry and topology of such a system. Particular encoding technique is offered to handle practical variation of diagrid modules. A variant of Pseudo-...